REDA-ILP: Learning Theories using EDA and Reduced Bottom Clauses
نویسندگان
چکیده
In our previous work we have introduced EDA-ILP, an Inductive Logic Programming (ILP) system based on Estimation Distribution Algorithm (EDA). EDA-ILP showed to be superior when compared to GA-ILP, a variation of EDA-ILP created replacing the EDA by a “conventional” Genetic Algorithm. Additionally, EDA-ILP proved to be very competitive when compared to the state of the art ILP system Aleph. This work presents REDA-ILP, an extension of EDA-ILP that employs the well-known Reduce algorithm in order to considerably reduce the search space. Preliminary results show that REDA-ILP, when compared to EDA-ILP, achieves equivalent accuracies results while considerably reduces the search time in order to find simpler theories.
منابع مشابه
Efficient learning and evaluation of complex concepts in inductive logic programming
Inductive Logic Programming (ILP) is a subfield of Machine Learning with foundations in logic programming. In ILP, logic programming, a subset of first-order logic, is used as a uniform representation language for the problem specification and induced theories. ILP has been successfully applied to many real-world problems, especially in the biological domain (e.g. drug design, protein structure...
متن کاملLearning Recursive Theories in the Normal ILP Setting
Induction of recursive theories in the normal ILP setting is a difficult learning task whose complexity is equivalent to multiple predicate learning. In this paper we propose computational solutions to some relevant issues raised by the multiple predicate learning problem. A separate-andparallel-conquer search strategy is adopted to interleave the learning of clauses supplying predicates with m...
متن کاملHybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success, it is known that Bottom Generalisation, and therefore Progol5, are restricted to finding hypotheses that lie within the semantics of Plotkin’s relative subsumption. This paper exposes a previously unknown incompleten...
متن کاملILP : - Just Trie It
Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques have been proposed to address the efficiency issue. Such proposals include query transformations, query packs, lazy evaluation and parallel execution of ILP systems, to mention just a few. We propose a novel technique to improv...
متن کاملBackground Knowledge-enrichment for Bottom Clauses Improving
In this paper we present a method to enrich the hypothesis language which is used to construct the bottom clause. This approach, which is embedded in the Aleph system, is based on numerical fixed subintervals and categorical subsets. Each subinterval/subset contains values, for each attribute which is predefined, that are related with the example to saturate. The enriched language allows to red...
متن کامل